Iteration Trees
نویسنده
چکیده
large cardinal hypothesis used to prove I1~+1 determinacy in [MS] cannot be substantially improved. Our theorem is an application of the theory of core models or canonical inner models for large cardinal hypotheses. Our work develops further some of the basic ideas of this theory. The theory itself has many other applications, particularly in the realm of relative consistency results. (As a quotable paradigm for a broad class of results, let us mention the following theorem of Solovay and Shelah: ZF + DC + "All sets of reals are Lebesgue measurable" is consistent if and only if ZFC + "There is an inaccessible cardinal" is consistent. In the "only if' direction, the model that one produces of ZFC + "There is an inaccessible cardinal" is a core model and, in fact, the smallest core model, Godel's L.) We shall begin with a general description of core model theory, of some of its history, and of the advance we have made. Many statements of mathematical interest cannot be decided in ZFC, the commonly accepted system of axioms for set theory. There are many widely varying and mutually incompatible ways of removing parts of this incompleteness. Among the multitude of corresponding models of ZFC, however, the class of core models stands out. The models in this class have a high degree of resemblance to one another, and there are powerful methods which produce a detailed account of their structure. On the other hand, the class seems rich enough to
منابع مشابه
A Perron Iteration for the Solution of a Quadratic Vector Equation Arising in Markovian
We propose a novel numerical method for solving a quadratic vector equation arising in Markovian binary trees. The numerical method consists of a fixed-point iteration, expressed by means of the Perron vectors of a sequence of nonnegative matrices. A theoretical convergence analysis is performed. The proposed method outperforms the existing methods for close-to-critical problems.
متن کاملA Perron Iteration for the Solution of a Quadratic Vector Equation Arising in Markovian Binary Trees
We propose a novel numerical method for solving a quadratic vector equation arising in Markovian Binary Trees. The numerical method consists in a fixed point iteration, expressed by means of the Perron vectors of a sequence of nonnegative matrices. A theoretical convergence analysis is performed. The proposed method outperforms the existing methods for close-to-critical problems.
متن کاملDeterminacy Proofs for Long games
1. Preliminaries: (a) The games. (b) Extenders, iteration trees. (c) Auxiliary game representations. (d) Example: Σ 1 2 determinacy. 2. Games of length ω · ω with Σ 1 2 payoff. 3. Continuously coded games with Σ 1 2 payoff.
متن کاملDACTAL: divide-and-conquer trees (almost) without alignments
MOTIVATION While phylogenetic analyses of datasets containing 1000-5000 sequences are challenging for existing methods, the estimation of substantially larger phylogenies poses a problem of much greater complexity and scale. METHODS We present DACTAL, a method for phylogeny estimation that produces trees from unaligned sequence datasets without ever needing to estimate an alignment on the ent...
متن کاملTriangulating stable laminations
We study the asymptotic behavior of random simply generated noncrossing planar trees in the space of compact subsets of the unit disk, equipped with the Hausdorff distance. Their distributional limits are obtained by triangulating at random the faces of stable laminations, which are random compact subsets of the unit disk made of non-intersecting chords coded by stable Lévy processes. We also s...
متن کاملConvergence of reinforcement learning using a decision tree learner
In this paper, we propose conditions under which Q iteration using decision trees for function approximation is guaranteed to converge to the optimal policy in the limit, using only a storage space linear in the size of the decision tree. We analyze different factors that influence the efficiency of the proposed algorithm, and in particular study the efficiency of different concept languages. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994